Characterising Strong Normalisation for Explicit Substitutions
نویسندگان
چکیده
We characterise the strongly normalising terms of a composition-free calculus of explicit substititions (with or without garbage collection) by means of an intersection type assignment system. The main novelty is a new cut-rule which allows to forget the context of the minor premise when the context of the main premise does not have an assumption for the cut variable.
منابع مشابه
A Calculus of Explicit Substitutions Which Preserves Strong Normalisation , a Calculus of Explicit Substitutions Which Preserves Strong Normalisation
Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and LLvy to internalise substitutions into-calculus and to propose a mechanism for computing on substitutions. is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. is simple and preserves strong normalisation. Apparently that important property cannot stay...
متن کاملExtending a -calculus with Explicit Substitution Which Preserves Strong Normalisation into a Connuent Calculus on Open Terms
The last fteen years have seen an explosion in work on explicit substitution, most of which is done in the style of the-calculus. In (Kamareddine & R os, 1995a), we extended the-calculus with explicit substitutions by turning de Bruijn's meta-operators into object-operators ooering a style of explicit substitution that diiers from that of. The resulting calculus, s, remains as close as possible...
متن کاملCalculi of Generalised -Reduction and Explicit Substitutions: The Type Free and Simply Typed Versions
Extending the-calculus with either explicit substitution or generalised reduction has been the subject of extensive research recently and still has many open problems. This paper is the rst investigation into the properties of a calculus combining both generalised reduction and explicit substitutions. We present a calculus, gs, that combines a calculus of explicit substitution, s, and a calculu...
متن کاملA Theory of Explicit Substitutions with Safe and Full Composition
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the first part of this paper. Then, very simple technology in named variable-style notation is used to establish a theory of explicit substitutions for the lambd...
متن کاملDelayed Substitutions
This paper investigates an approach to substitution alternative to the implicit treatment of the λ-calculus and the explicit treatment of explicit substitution calculi. In this approach, substitutions are delayed (but not executed) explicitly. We implement this idea with two calculi, one where substitution is a primitive construction of the calculus, the other where substitutions is represented...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002